| 1. | Structure does not map naturally to the object graph structure of serialization , and vice versa
结构并不能自然地映射到序列化的对象图结构，反之亦然。 |
| 2. | Because graph structure has powerful ability of data representation , it has been widely used in many aspects
由于图结构具有强大的表示能力,它在许多方面有着广泛的应用。 |
| 3. | Graphplan was the first planner which using the high efficiency planning graph structure in planner design
图规划首次将规划图应用于规划器设计。规划图的高度并行性使得规划器求解效率有了质的飞跃。 |
| 4. | 2 . we prove that one kind of invertible autonomous automata has the same graph structure as its affine autonomous automata [ theorem 4 . 5 ]
( 2 )证明了布尔环上的一类可逆线性内动机的图型与其仿射内动机的图型相同定理4 . 5 。 |
| 5. | 34 sun y f , chen h . gsfc : the storage of free cube based on graph structure . journal of computer research and development , 2004 , 41 : 1652 - 1660
本文简介了我们在立方体计算技术方面的若干创新研究成果，以及开发的并行数据仓库和联机分析系统paraware 。 |
| 6. | 3 . the graph structure of some non - invertible autonomous automata is discussed in regular space , orthogonal space , and orthonormal space respectively . some new results are derived [ theorem 3 . 10 - 3 . 13 ]
( 3 )讨论了非可逆线性内动机在正规空间、直交空间、正交空间上的图型结构问题[定理3 . 10 3 . 13 ] 。 |
| 7. | We explore the graph structure of the autonomous automata over boolean ring and derive the following new results : 1 . we determine the graph structure of a kind of exact - equibranch down - oriented - tree autonomous automata and of a kind of invertible autonomous automata [ theorem 4 . 1 - 4 . 4 ]
本文研究了有限布尔环上的内动机图型结构，取得了下列成果: ( 1 )定出了布尔环上的一类具有等叉下向树形的线性内动机和一类可逆线性内动机的图型定理4 . 1 ~ 4 . 4 ] 。 |
| 8. | The computational cost involved no longer increases exponentially with the number of vertices of the meshes to be fused . ( 2 ) the algorithm is robust as the ambiguity in graph structure combination is alleviated . ( 3 ) the detail of the cut mesh is fully kept
与原有的基于全局调和映射的融合方法相比，新方法具有以下优点： ( 1 )算法效率大幅度提升，求解时间不再随融合模型顶点数的增加而指数增长； ( 2 )减少了二维网格拓扑合并中奇异情况出现的概率，提高了算法的稳定性； ( 3 )被剪切网格的细节得到完整保留； ( 4 )消除了原算法对融合区域拓扑的限制。 |
| 9. | 3 ) presentation and implementation of key - based relational schema reverse reconstruction algorithm ( krr ) . based on discrete mathematics theory , a krr algorithm is proposed which can realize the transformation from relational schema to directed graph structure and get a good data preparation for the sequential schema mapping
3 )提出基于key的关系模式重构算法以离散数学理论为基础，对关系模式数学建模，通过提出基于key的关系模式重构算法，将关系模式转化为有向图数据结构，为模式映射提供基础。 |
